The Toggle Group, Homomesy, and the Razumov-Stroganov Correspondence
نویسنده
چکیده
The Razumov-Stroganov correspondence, an important link between statistical physics and combinatorics proved in 2011 by L. Cantini and A. Sportiello, relates the ground state eigenvector of the O(1) dense loop model on a semi-infinite cylinder to a refined enumeration of fully-packed loops, which are in bijection with alternating sign matrices. This paper reformulates a key component of this proof in terms of posets, the toggle group, and homomesy, and proves two new homomesy results on general posets which we hope will have broader implications.
منابع مشابه
The Razumov-Stroganov conjecture: Stochastic processes, loops and combinatorics
The Razumov-Stroganov conjecture: Stochastic processes, loops and combinatorics 2
متن کاملQuantum incompressibility and Razumov Stroganov type conjectures
We establish a correspondence between polynomial representations of the Temperley and Lieb algebra and certain deformations of the Quantum Hall Effect wave functions. When the deformation parameter is a third root of unity, the representation degenerates and the wave functions coincide with the domain wall boundary condition partition function appearing in the conjecture of A.V. Razumov and Y.G...
متن کاملA bijectional attack on the Razumov-Stroganov conjecture
We attempt to prove the Razumov-Stroganov conjecture using a bijectional approach. We have been unsuccessful but we believe the techniques we present can be used to prove the conjecture.
متن کاملA refined Razumov-Stroganov conjecture
We extend the Razumov-Stroganov conjecture relating the groundstate of the O(1) spin chain to alternating sign matrices, by relating the groundstate of the monodromy matrix of the O(1) model to the so-called refined alternating sign matrices, i.e. with prescribed configuration of their first row, as well as to refined fully-packed loop configurations on a square grid, keeping track both of the ...
متن کاملProof of the Razumov-Stroganov Conjecture for some Infinite Families of Link Patterns
We prove the Razumov–Stroganov conjecture relating ground state of the O(1) loop model and counting of Fully Packed Loops in the case of certain types of link patterns. The main focus is on link patterns with three series of nested arches, for which we use as key ingredient of the proof a generalization of the MacMahon formula for the number of plane partitions which includes three series of pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015